(TD)2PaM: A Constraint-Based Algorithm for Mining Temporal Patterns in Transactional Databases
نویسندگان
چکیده
The analysis of frequent behaviors regarding temporal issues begins to achieve some interest, in particular in the area of health care. However, existing approaches tend to ignore the temporal information and only make use of the order among events occurrence. In this paper, we introduce the notion of temporal constraint, and propose three instantiations of it: complete cyclic temporal constraints, partial cyclic temporal constraints and timespan constraints. Additionally, we propose a new algorithm – (TD)PaM, that together with these constraints, makes possible to focus the pattern mining process on looking for cyclic and timespan patterns. Experimental results reveal the algorithm to be as efficient as its predecessors, and able to discover more informed patterns.
منابع مشابه
Data sanitization in association rule mining based on impact factor
Data sanitization is a process that is used to promote the sharing of transactional databases among organizations and businesses, it alleviates concerns for individuals and organizations regarding the disclosure of sensitive patterns. It transforms the source database into a released database so that counterparts cannot discover the sensitive patterns and so data confidentiality is preserved ag...
متن کاملDiscovering Periodic-Frequent Patterns in Transactional Databases
Since mining frequent patterns from transactional databases involves an exponential mining space and generates a huge number of patterns, efficient discovery of user-interest-based frequent pattern set becomes the first priority for a mining algorithm. In many real-world scenarios it is often sufficient to mine a small interesting representative subset of frequent patterns. Temporal periodicity...
متن کاملMaRFI: Maximal Regular Frequent Itemset Mining using a pair of Transaction-ids
Frequent pattern mining is the fundamental and most dominant research area in data mining. Maximal frequent patterns are one of the compact representations of frequent itemsets. There is more number of algorithms to find maximal frequent patterns that are suitable for mining transactional databases. Users not only interested in occurrence frequency but may be interested on frequent patterns tha...
متن کاملNovel Algorithms TempCIPFP for Mining Frequent Patterns using Counting Inference from Probabilistic Temporal Databases and Future Possibilities
In this paper we present novel algorithms TempCIPFP for Mining Frequent Patterns using Counting Inference from Probabilistic Temporal Databases and we also discussed future possibilities. We consider the problem of discovering frequent itemsets and association-rules between/among items in a large database of transactional databases acquired under uncertainty in certain time. With each timestamp...
متن کاملPREVENT: An Algorithm for Mining Inter- transactional Patterns for the Prediction of Rare Events
In this paper we propose a data mining technique for the efficient prediction of rare events, such as heat waves, network intrusions and engine failures, using inter transactional patterns. Data mining is a research area that attempts to assist the decision makers with a set of tools to treat a wide range of real world problems that the traditional statistical and mathematical approaches are no...
متن کامل